-
1 merge algorithm
-
2 split/merge algorithm
English-Russian big polytechnic dictionary > split/merge algorithm
-
3 split/merge algorithm
1) Механика: алгоритм разделения-слияния2) Робототехника: алгоритм разделения/ слияния (в обработке изображений) -
4 split/merge algorithm
Англо-русский словарь по машиностроению > split/merge algorithm
-
5 merge
слияние, объединение, сливать, объединять, программа слияния, программа объединения
– merge algorithm
-
6 sort algorithm
= sorting algorithmкаждый алгоритм сортировки можно отнести к одному из трёх базовых методов: перестановка элементов, их отбор и вставка.Sorting is a fundamental operation in computer science, and as a result a large number of good sorting algorithms have been developed. — Сортировка является одной из базовых операций в вычислительной науке и технике, поэтому для её реализации разработано много эффективных алгоритмов см. тж. alphanumeric sort, bubble sort, case-insensitive sort, collating sort, counting sort, dictionary sort, heap sort, in place sorting, insertion sort, linguistic sort, merge sort, ordering algorithm, Shell sort, sort
Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > sort algorithm
-
7 sort
1) сортировка [данных], упорядочиваниеизменение очерёдности (порядка) следования элементов данных (например, строк таблицы или записей БД) в соответствии с некоторым заданным правилом, признаком или группой признаков; обычно по возрастанию или убыванию значений ключевых полейсм. тж. ascending sort, automatic sorting, bubble sort, collating sort, descending sort, external sort, insertion sort, internal sort, lexicographic sort, merge sort, multilevel sort, multipass sort, nested sort, sort algorithm, sort key, sort order, transposition2) вид, тип, класс3) сортировать, упорядочиватьАнгло-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > sort
См. также в других словарях:
Merge algorithm — Merge algorithms are a family of algorithms that run sequentially over multiple sorted lists, typically producing more sorted lists as output. This is well suited for machines with tape drives. Use has declined due to large random access memories … Wikipedia
Package-merge algorithm — The Package Merge Algorithm is an O(nL) time algorithm for finding anoptimal length limited Huffman code for a given distribution on a given alphabet of size n , where no code word is longer than L . It is a greedy algorithm, and a generalization … Wikipedia
Merge sort — Example of merge sort sorting a list of random dots. Class Sorting algorithm Data structure Array Worst case performance O(n log n) … Wikipedia
Merge (revision control) — Merging (also called integration) in revision control, is a fundamental operation that reconciles multiple changes made to a revision controlled collection of files. Most often, it is necessary when a file is modified by two people on two… … Wikipedia
Merge — See Help:Merging for the usage of Merge in Wikipedia. Contents 1 Concepts 2 Computer science 3 Music … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Sort-merge join — The Sort Merge Join (also known as Merge Join) is an example of a join algorithm and is used in the implementation of a relational database management system. The basic problem of a join algorithm is to find, for each distinct value of the join… … Wikipedia
Ramer–Douglas–Peucker algorithm — The Douglas–Peucker algorithm is an algorithm for reducing the number of points in a curve that is approximated by a series of points. The initial form of the algorithm was independently suggested in 1972 by Urs Ramer and 1973 by David Douglas… … Wikipedia
Sorting algorithm — In computer science, a sorting algorithm is an algorithm that puts elements of a list in a certain order. The most used orders are numerical order and lexicographical order. Efficient sorting is important for optimizing the use of other… … Wikipedia
Nearest-neighbor chain algorithm — In the theory of cluster analysis, the nearest neighbor chain algorithm is a method that can be used to perform several types of agglomerative hierarchical clustering, using an amount of memory that is linear in the number of points to be… … Wikipedia
Nondeterministic algorithm — In computer science, a nondeterministic algorithm is an algorithm that can exhibit different behaviors on different runs, as opposed to a deterministic algorithm. There are several ways an algorithm may behave differently from run to run. A… … Wikipedia
